Mining temporal patterns in longitudinal event data using discrete event matrices and sparse coding

ABSTRACT

Methods and systems for event pattern mining are shown that include representing longitudinal event data in a measurable geometric space as a temporal event matrix representation (TEMR) using spatial temporal shapes, wherein event data is organized into hierarchical categories of event type and performing temporal event pattern mining with a processor by locating visual event patterns among the spatial temporal shapes of said TEMR using a constraint sparse coding framework.

BACKGROUND

1. Technical Field

The present invention relates to data mining and, in particular, to methods and systems for extracting meaningful information from temporal event data.

2. Description of the Related Art

Temporal event mining is the process of identifying and extracting latent temporal patterns from large complex event data. The goal of event mining is to derive insight that leads to useful information and true knowledge for an accurate understanding of the underlying event processes and relationships. It is the transformation from data to information to true knowledge that is of interest to business, the science, and government.

In this regard, finding optimal knowledge representations is important when one talks about abstract models as surrogates of the real world that must be understood by humans. Knowledge representation (KR) and reasoning is an area of artificial intelligence whose fundamental goal is to represent knowledge in a manner that facilitates the inference process from knowledge. An optimal knowledge representation should exhibit the following characteristics: i) minimalism, ii) interpretability, and iii) novelty. Further, the knowledge representation should be commensurate with human constraints and abilities so people can quickly absorb, understand, and make most efficient use of complex event data. All attempts to produce such a knowledge representation to date have fallen short. One drawback of these attempts is that symbolic languages specify temporal knowledge a priori, which limits the flexibility of learning unknown patterns in temporal event data.

SUMMARY

A method for event pattern mining includes representing longitudinal event data in a measurable geometric space as a temporal event matrix representation (TEMR) using spatial temporal shapes, wherein event data is organized into hierarchical categories of event type, and performing temporal event pattern mining with a processor by locating visual event patterns among the spatial temporal shapes of said TEMR using a constraint sparse coding framework.

A further method for event pattern mining includes mapping longitudinal event data from a probabilistic event space to a temporal event matrix representation (TEMR) in a measurable geometric space, wherein event data is organized into hierarchical categories of event type, performing temporal event pattern mining with a processor by locating visual event patterns among the spatial temporal shapes of said TEMR using a processor to perform online non-negative matrix factorization by clustering and ranking multiple entities into pattern groups, and refining the learned patterns using user feedback.

A system for event pattern mining includes an event matrix generator configured to represent longitudinal event data in a measurable geometric space as a temporal event matrix representation (TEMR) using spatial temporal shapes, wherein event data is organized into hierarchical categories of event type, and a temporal event data mining component configured to perform temporal event pattern mining with a processor by locating visual event patterns among the spatial temporal shapes of the TEMR using a constraint sparse coding framework.

These and other features and advantages will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings.

BRIEF DESCRIPTION OF DRAWINGS

The disclosure will provide details in the following description of preferred embodiments with reference to the following figures wherein:

FIG. 1 is a block/flow diagram showing a geometric knowledge representation used for temporal event mining.

FIG. 2 is a diagram showing a temporal event matrix representation (TEMR) of event data.

FIG. 3 is a diagram showing a sparse representation of a TEMR.

FIG. 4 is a diagram showing grouping multiple temporal event matrices into a tensor representation.

FIG. 5 is a block/flow diagram showing a method for online learning of a group structure.

FIG. 6 is a block/flow diagram showing a method/system for temporal event mining.

FIG. 7 is a block/flow diagram showing an interactive system for temporal event mining.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Temporal event mining derives insights from data that lead to useful information and true knowledge, allowing for a precise understanding of underlying event processes and relationships. A general framework for open-ended visual interactive temporal event pattern mining is presented herein, wherein the extracted latent temporal patterns and mining system are commensurate with human capabilities. In particular, the present principles produce interpretable patterns and low dimensional visual representations of complex event data that can be quickly absorbed by human beings. The present temporal event mining includes an open-ended learning system that is able to incrementally learn the latent temporal patterns on large-scale data. Also the mining framework accounts for missing values, data sparsity, multiple sources, mixed continuous/categorical variables, binary/multi/vectorial valued elements, and heterogeneous data domains.

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

Referring now to the drawings in which like numerals represent the same or similar elements and initially to FIG. 1, a diagram of a geometric knowledge representation according to the present principles is shown. This representation is referred to herein as a temporal event matrix representation (TEMR). An entity 102 can be a person, a patient, an object, or a location. Each entity has associated a probabilistic event space 104 comprised of a space and a time dimension, such that the space may be characterized as having dimensionality R³×R. TEMR 106 maps the space-time dimensionality R³×R of a probabilistic event space 104 onto a measurable geometric space 108 having dimensionality R². This projective mapping produces a rich set of mathematical constructs to perform temporal event mining 110 by taking into account spatial-temporal information encoded by TEMR 106. In TEMR 106, hybrid combinations of semantic-invariant shape and probabilistic metrics are possible that provide a flexible framework for temporal event mining 110.

TEMR 106 allows the encoding of the temporal concepts of order, duration, coincidence, concurrency, synchronicity, and periodicity of time patterns such as events, periods, and trends. The use of geometric visual shape primitives provides a rich set of constructs to model, learn, and perform inference on the chosen representational space 108. Temporal operators for qualitative temporal reasoning have quantitative meaning in the measurable geometric space that allows temporal operators to be expressed in terms of geometric properties and distance metrics. These temporal operators may include, for example, before, after, close, equals, shortly after, and soon after. By using shape invariant metrics, semantic invariances can be modeled and introduced into the analysis. The chosen geometric representational space offers a wide set of tools which may be applied from the signal and image processing community.

In this way, the present principles provide a geometric knowledge representation 108 for temporal event mining. TEMR 106 maps the space-time dimensionality of a probabilistic event space 104 onto a measurable geometric space 108 by encoding event data as a structured spatial-temporal shape or point process. This projective mapping may be achieved by using a rich geometric visual symbol system forming a structured two-dimensional sparse matrix. This approach is exemplified herein with point processes assuming the most simplistic form of an event. Such point processes are modeled herein as a binary random variable.

Referring now to FIG. 2, an example of the TEMR 106 is shown as a realization of a spatial-temporal shape process. TEMR is composed of a set of geometric shape primitives that symbolize event data in a two-dimensional sparse matrix representation. The set of geometric shape primitives can be arbitrary (e.g. including a set of visual variables of position, size, shape, value, color, orientation, and texture). FIG. 2 exemplifies the concept by showing the simplest primitive of a binary activation unit in the form of a black square. TEMR is a sparse two-dimensional discrete matrix, representing the measurable geometric space 108, where the rows of the matrix correspond to pre-specified structured event categories and the columns of the matrix to the time domain. In other words, the horizontal axis represents time, whereas the vertical axis represents event type. Based on the chosen visual variables, the row and column mapping can change according to the size of the visual encoding. The rows of TEMR are further structured into a hierarchical grouping 208, where the event space is grouped into semantic similar groups. Events are further grouped into temporally neighboring patterns 202, 204, and 206, and an activation graph shows the occurrence and recurrence of these patterns over time. To learn a sparse representation of the latent temporal patterns and their activation codes the present invention uses a constraint convolutional sparse coding framework.

Sparsity may arise in two contexts. First, binary event realizations, where a ‘1’ indicates that an event happened and a ‘0’ indicates that an event did not happen, usually are sparse in the number of events that fill the space. TEMR 106 thus encodes missing events within the measurable geometric space 108. As a result, the majority of the sparse two-dimensional matrix elements will have ‘0’ entries and only a few elements will have non-zero entries. This is referred to as data sparsity. Second, latent temporal event patterns also exhibit a sparse structure. Latent temporal patterns, shown as a set of rows and columns within the sparse two-dimensional matrix or alternatively as a sub-region within the matrix, can happen at sparse time instances as well. A sparse representation offers efficient storage and also aids interpretability at the data level and the model level. Learning a sparse representation of TEMR 106 is also referred to as learning a latent factor model. Sparsity is particularly relevant to model interpretability. To exemplify this, consider FIG. 2. The activation plot exhibits a sparse structure, such that the majority of entries are zero. In the converse case, where most entries would be non-zero, it would be difficult for an unaided person to see patterns in the data.

The constrained convolutional sparse coding framework learns minimalistic and interpretable latent temporal event patterns from single and multiple spatial-temporal point processes (STPP). Double sparsity (i.e. the sparsity in the data as well as in the latent factor model) can be dealt with by using the beta-divergence. The beta-divergence is a parameterized family of cost functions that measures the difference between two probability distributions. The present principles use a special case of the beta-divergence, where β=0.5, since because this parameterization optimally copes with binary data. Convolutional sparse population coding is further introduced below. This coding is able to learn multiple group specific latent factors simultaneously. Stochastic optimization allows for large-scale incremental learning of multiple STPPs in a group.

Each event group itself contains a variable number of different event types. The horizontal lines in the Structured Event Category graph of FIG. 2 visualize the vertical partition of the event grouping. In the matrix, the black squares correspond to event realizations of different event types, whereas white space corresponds to non-event realizations. In this way, missing event values are encoded within the TEMR 106. Within the matrix of FIG. 2, three different temporal patterns are shown. A first pattern A thus contains, e.g., the following information: An event of type 6 in event group 3 occurred followed by three simultaneous events in event group 1, 2, and group n at the second, third, and first row of each group respectively. Pattern A 202 has two occurrences in this TEMR 106. Pattern B 204 also has two occurrences, while pattern C 206 has three occurrences. The arrows in the activation plot represent the sparse time locations where the different patterns occur.

The fundamental unit of analysis is a single event from which a pair of events can be used to define an event interval or a set of ordered events to define an event sequence. Each event sequence belongs to a labeled category that is itself part of a hierarchical grouping 208. Multiple event sequences and hierarchies can be encoded with TEMR forming a multivariate representation, where the rows of the temporal event matrix encode event categories and the columns of the matrix the time domain. In what follows, such a multivariate event sequence may be viewed as a structured STPP.

The term sparse coding refers to the modeling of data x as a sparse linear combination of basis atoms Φ=[φ₁, . . . , φ_(k)], with φ_(i)εR^(m×l) and their weighting or activation coefficients α=[α₁, . . . , α_(k)]^(T). Consider a sparse linear data model with additive noise nεR^(m×l) of the following form:

$\begin{matrix} {\lbrack x\rbrack = {{\begin{bmatrix} \phi_{1} & \ldots & \phi_{k} \end{bmatrix}\begin{bmatrix} {\alpha\lbrack 1\rbrack} \\ \vdots \\ {\alpha\lbrack k\rbrack} \end{bmatrix}} + \lbrack n\rbrack}} & (1) \end{matrix}$ The input data xεR^(m) permits a sparse approximation over a bases set ΦεR^(m×k), with k atoms determined by the weighting coefficients αεR^(k), where one can find a linear combination of a sparse set of bases atoms from Φ, such that it closely approximates the input data.

The sparse decomposition problem can be formulated as the sum of a loss function L(•) and a regularization term φ(•):

$\begin{matrix} {\alpha^{*} = {\min\limits_{\alpha}\left( {O\left( {x,\Phi,\alpha} \right)} \right)}} & (2) \\ {{O\left( {x,\Phi,\alpha} \right)} = {{L\left( {x,\Phi,\alpha} \right)} + {{\lambda\varphi}(\alpha)}}} & (3) \\ {{{L( \cdot )} = {\frac{1}{2}{{x - {\Phi\alpha}}}_{F}^{2}}},} & (4) \end{matrix}$ where λ denotes the sparsity including weighting factor for the regularizer and ∥•∥_(F) denotes the Frobenius norm. By choosing φ(•) to be the l₁-norm (e.g.,

$\left. {{\varphi(\alpha)} = {{\alpha }_{1}\overset{\Delta}{=}{\sum\limits_{i}^{p}{{\alpha\lbrack i\rbrack}}}}} \right),$ equations 2-4 may also be interpreted as a basis-pursuit or lasso problem. To obtain a sparse representation, the l₁-norm regularizer is convex and serves as a proxy for the NP-hard l₀-norm. The objective in the above equations has no analytic closed form solution, such that iterative approaches are used. These iterative approaches may include greedy algorithms, homotopy, soft-thresholding, active set, or reweighted l₂ methods. These methods are listed for the sake of example and are not intended to be limiting.

Non-negative matrix factorization (NMF) arises as an extension of large-scale non-negative least squares. NMF finds a “parts-based” or “sum-of-parts” linear representation of non-negative data. Given a non-negative data matrix X=[x₁, . . . , x₂]εR₊ ^(m×n) and a positive integer r=min(m,n), NMF computes a low-rank approximation:

$\begin{matrix} {{{X \approx {WH}} = {\sum\limits_{k = 1}^{r}{W_{ik}H_{kj}}}},} & (5) \end{matrix}$ with W being a factor matrix, H being a scores matrix, and r being a low-rank factor. Usually, r<<(m,n) (n+m)r<nm, and i, j, and k are matrix indices. The indices i and j refer to a matrix row and column respectively. The above equation decomposes a non-negative matrix into a product of two lower-rank non-negative matrices. The r columns of WεR₊ ^(m×r) are basis vectors and each row of HεR₊ ^(r×n) is a linear encoding representing the mixing coefficients or “weights” for each basis.

In vector notation, each n columns of X=[x₁, . . . , x₂]εR₊ ^(m×n) is a linear combination of the columns of W weighted by the row coefficients of H:

$\begin{matrix} {{x_{i} \approx {\sum\limits_{k = 1}^{r}{w_{\cdot i}h_{kj}}}},} & (6) \end{matrix}$ where w_(.i) is the column vector of W. The conventional solution approach to eq. (6) is to solve the following constrained optimization problem:

$\begin{matrix} {\min\limits_{W,H}{= {{{X - {WH}}}_{F}^{2} = {\sum\left( {X_{ij} - ({WH})_{ij}} \right)^{2}}}}} & (7) \\ {{{subject}\mspace{14mu}{to}\mspace{14mu}{\forall{{ij}:{\lbrack w\rbrack_{ij} \geq 0}}}},{\lbrack h\rbrack_{ij} \geq 0},{{\forall{i:{w_{i}}}} = 1}} & (8) \end{matrix}$ where ∥•∥_(F) is the matrix Frobenius norm. Various strategies may be used to minimize eqs (7) and (8), such as alternating least-squares, multiplicative update rules, projected gradient descent algorithms, and hybrid derivatives. These strategies are presented for the sake of example and are not intended to be limited in any way.

The NMF framework may incorporate sparsity by using a regularizer, as above in eq (3), which enforces sparsity in the coefficient matrix H. Non-negative sparse coding of a non-negative data matrix XεR₊ ^(m×n) may be implemented by formulating the optimization problem:

$\begin{matrix} {\left\{ {W^{*},H^{*}} \right\} = {\min\limits_{W,H}{O\left( {X,W,H} \right)}}} & (9) \\ {{O\left( {X,W,H} \right)} = {{\frac{1}{2}{{X - {WH}}}^{2}} + {\lambda{\sum\limits_{ij}\lbrack h\rbrack_{ij}}}}} & (10) \\ {{{subject}\mspace{14mu}{to}\mspace{14mu}{\forall{{ij}:{\lbrack w\rbrack_{ij} \geq 0}}}},{\lbrack h\rbrack_{ij} \geq 0},{{\forall{i:{w_{i}}}} = 1}} & (11) \end{matrix}$ where the last constraint is a scaling constraint enforced on W to prevent trivial solutions of the factorization due to the sparsity inducing regularizer. A multiplicative update rule may be used for H and a projected gradient descent may be used to update W:

$\begin{matrix} {H:={{H \circ \left( {W^{T}X} \right)}/\left( {{W^{T}{WH}} + \lambda} \right)}} & (12) \\ {W:={P\left\lbrack {W - {{\eta\left( {{WH} - X} \right)}H^{T}}} \right\rbrack}} & (13) \\ {{{where}\mspace{14mu}{P(u)}} = \left\{ \begin{matrix} {u_{ij},} & {{{if}\mspace{14mu} u_{ij}} \geq 0} \\ {0,} & {{{if}\mspace{14mu} u_{ij}} < 0} \end{matrix} \right.} & (14) \\ {{{with}\mspace{14mu} u_{i}^{T}u_{i}} \leq 1.} & (15) \end{matrix}$

A transformation-invariant form includes introducing a linear transformation operator (or “shift” operator) T into the NMF objective. Transformation invariance can be incorporated into the sparse coding formulation described above by performing a stochastic optimization within a convolutional sparse coding framework to support large-scale factorization of single and multiple STPPs for common group learning. When β=0.5, parameterized beta-divergence achieves superior performance and can be extended to allow factorization of a common dictionary for group learning.

By using online NMF (ONMF), latent factors may be automatically updated by combining old factors with newly acquired data. At the same time, ONMF can discover the connections between old and new factors, allowing the evolutionary patterns of latent factors to be tracked naturally. In addition, when the available data is incomplete, latent factors produced by NMF may be incorrect. To prevent the partial-data problem in ONMF, a set of orthogonal constraints is imposed on all of the latent factors. Additionally, an orthogonal NMF algorithm according to the present principles guarantees the uniqueness of the NMF decomposition, which helps in tracking latent factors. The present approach incorporates stochastic optimization within a convolutional sparse coding framework by employing a special case of the parameterized beta-divergence. The update equations, which are discussed in greater detail below, employ multiplicative update rules.

The temporal event matrix representation (TEMR) 106 provided by the present principles and shown in FIG. 2 uses a geometric approach to condense information into an effective but human-readable form. Whereas symbolic languages define temporal concepts a priori, the present geometric knowledge representation is able to represent and learn unknown temporal patterns. In addition, TEMR condenses complex multivariate temporal event relationships into an intuitive, interpretable, and simple visual form.

Temporal event pattern mining uses an efficient knowledge representation to facilitate intelligent reasoning and inference for knowledge discovery. An optimal knowledge representation should exhibit the following characteristics: i) flexibility, ii) minimalism, iii) interpretability, and iv) novelty. The knowledge representation should be commensurate with human capabilities, such that information can be quickly absorbed and understood to make the most efficient use of complex event data. Flexibility allows the knowledge representation to be used in many different application contexts. Efficiency allows for large-scale analysis and for environments with limited resources. Interpretability is important for an improved understanding of the representation and its underlying model as well as the ability to adapt and change. Novelty allows the representation to discover knowledge through the extracted patterns.

TEMR 106 comprises of a set of geometric shape primitives that symbolize event data in a two-dimensional sparse matrix representation. As noted above with respect to FIG. 1, TEMR 106 maps the space-time dimensionality of a probabilistic event space 104 onto a measurable geometric space of R² 108 by encoding event data as a structured spatial-temporal shape or point process. In this arrangement, hybrid combinations of semantic-invariant shape and probabilistic metrics can be applied to facilitate knowledge reasoning and inference.

As noted above with respect to FIG. 2, the fundamental unit of analysis is a single event e, shown as a black square. A pair of events can be used to define an event interval [e_(i), e_(i+1)] or a set of ordered events e_(i) to define an event sequence (a row of black squares). Each event sequence belongs to a labeled category that is itself part of a hierarchical grouping 208. Multiple event sequences and hierarchies can be encoded with TEMR forming a multivariate representation, where the rows of TEMR encode event type categories and the columns encode the time domain. Such multivariate event sequences are viewed below as a structured STPP.

More formally, let E denote the event space, which resides in a compact subset S of R^(n). A point process on S is a measurable map ξ:Ω→R from the probability space (Ω, F, P) to the measurable space (R,

), where Omega is the sample space, F and

a sigma-Algebra, and P the probability measure. Stochastic point processes (SPPs) can describe gaps, aggregation, and inhibition in spatial data. Every point process ξ can be represented as

${\xi = {\sum\limits_{i = 1}^{N}\delta_{X_{i}}}},$ where δ denotes the Dirac measure, N is an integer-valued random variable, and X_(i) are random elements of S. We consider a stack of multiple point processes to form a measurable map ξ:Ω→R^(c×t), where c indexes the event category and t indexes the time domain.

This leads to STPPs, which are random collections of points, wherein each point represents the time and location of an event. In comparison to a pure SPP, the temporal aspect of an STPP induces a natural point ordering that does not generally exist for SPPs. An STPP ξ may be mathematically defined as a random measure on a region S⊂R×R³ of space-time, taking values in the non-negative integers Z⁺.

Only binary random variables Xε[0,1] are considered herein. However, this is intended only for the purpose of illustration. Alternative variables, such as multi-valued random variables Xε[0, . . . , K] or vectorial representations may also be employed in accordance with the present principles. One can generalize an STPP to higher order primitives such as spatial line or shape processes. TEMR 106 allows one to incorporate such stochastic shape processes to provide a rich geometric symbol set of visual variables to encode different event entities and temporal concepts.

An event sequence ε_(p,q)=(e_(t=1), e_(t=2), . . . , e_(t=T)) may be defined as a univariate STPP ξ on R, characterizing a sequence of random variables X_(i). Each event e_(t) is an element of the realization of ξ. The indices p and q index the event group level and event type level respectively (where such group and event type levels are illustrated above in FIG. 2). To extend the univariate STPP to higher order structures beyond pairwise or triple-wise interactions, multiple ε_(p,q), q>1 can be stacked together. Multiple event sequences {ε_(p,q)} are bi-, tri-, or multi-variate STPPs ξ on R^(c×t), where c denotes the event category domain and t denotes the time domain.

Multiple STPPs {ξ_(i)}_(i=1) ^(n) form a three-way sparse tensor of the form R^(c×t×n). An alternative representation of a group of STPPs

_(ξ) is a tensor unfolded view of the form R^(c×(t*n+(n+l)*w), where multiple spatial-temporal point processes ξ_(i) are concatenated along the time domain. Multiple bi-, tri-, or multi-variate STPPs ξ_(i) form the group

_(ξ) on R^(c×l×n), where c is the event type domain, t is the time domain, and n is the sample cardinality of

_(ξ). Multiple groups

_(ξ) ^((t)) form a population

_(ξ)={

_(ξ) ^((t))}_(i=t) ^(g) of STPPs ξ_(i).

In order to adapt TEMR to particular instances of ξ_(i),

_(ξ), or

_(ξ), the matrix factorization framework discussed above is used to learn a minimalistic sparse representation suitable for temporal event pattern mining. In particular, the following temporal patterns are relevant: i) structured high activity patterns, ii) repeating patterns, iii) pattern trends, and iv) similar patterns in a group or population.

This may be formulated as finding a function ƒ:X→Y that maps an input space to an output space. Here X refers to the input space of ξ_(i)εS={ξ₁, . . . , ξ_(n)} and Y refers to a hypothetical label space inducing a multi-pathway partitioning on X. Let

={(ξ_(i),ŷ_(i))}_(j=1) ^(n) be a pair of spatial-temporal point processes ξ_(i)εR^(c×t) and partition encodings ŷ_(i)εZ^(k), where ŷ_(i) is unknown.

First, a minirnalistic efficient sparse representation

_(Θ)={Φ,α} of ξ_(i) is generated that captures the latent structure for individual and group-based event realizations in S:

$\begin{matrix} {\mathcal{R}_{\Theta}^{*}{\min\limits_{\mathcal{R}_{\ominus}}{O\left( {S,\Theta} \right)}}} & (16) \\ {{\min\limits_{\mathcal{R}_{\ominus}}{O\left( {S,\Theta} \right)}} = {{\sum\limits_{j = 1}^{g}{\sum\limits_{i = 1}^{n}{L\left( {\xi^{({i,j})},\Phi,\alpha^{({i,j})}} \right)}}} + {{{\lambda\varphi}\left( \alpha^{({i,j})} \right)}.}}} & (17) \end{matrix}$ Since n is large, a stochastic optimization scheme is used where data samples arrive in a sequential manner and

_(Θ) is adaptively learned from ξ_(i) incrementally:

_(Θ) ^(t+1)=

_(Θ) ^(t) +O(ξ_(i),Θ,α).

Given

, ŷ is found such that the learned approximation to ƒ groups similar entities to the same hypothetical label class of ŷ. Given an instance of ξ_(i)εS, a ranking can be found that returns the most similar instances of ξ_(j≠i) to ξ_(i).

A dynamic data model is used to learn ξ. The static linear data model in eq (1) does not account for the temporal aspect encoded in ξ. A dynamic linear data model is used having the form:

$\begin{matrix} {\xi = {{\Phi*\alpha} + N}} & (18) \\ {= {{\sum\limits_{k}\;{\sum\limits_{r = 1}^{M}\;{\phi_{k}^{T}\alpha_{k,T}}}} + N}} & (19) \\ {= {{\sum\limits_{k,u,v}\;{{\phi_{k}\left( {{i - u},{j - v}} \right)}{\alpha_{k}\left( {u,v} \right)}}} + N}} & (20) \end{matrix}$ where ξεR^(n×t), ΦεR^(u×v×k), αεR^(k×t), * denotes a shift-invariant convolutional operator, M denotes the shift dimension, and r denotes the shift index.

Referring now to FIG. 3, a graphical representation of equation (18) is shown, illustrating how the patterns of Φ 304 may be convolved with the sparse coding α 306 that shows when each of the patterns occurs. FIG. 3 is a sparse representation of TEMR 106. Equation (18) shows a dynamic data model where ξ 302 represents a realization of an STPP represented with TEMR. The right hand side of equation (18) is a convolution between a basis set Φ 304 and an activation code α 306.

A shift-invariant dictionary Φ 304 may be found given a realization of ξ, as well as an associated sparse code α 306 of Φ 304. The emphasis is on learning an efficient minimalistic representation

_(Θ) with θ={Φ,α) of ξ 302 such that a 306 exhibits a sparse structure. Learning

_(Θ) can be achieved by coupling an approximation error objective with a sparseness constraint on the weighting coefficients, where the data model exhibits a convolutional form:

$\begin{matrix} {{L\left( {\xi,\theta} \right)} = {{\arg\;{\min\limits_{\theta}{\frac{1}{2}{{\xi - {\Phi*\alpha}}}_{2}^{2}}}} + {\lambda{{\alpha }_{1}.}}}} & (21) \end{matrix}$

Eq (21) is also known as the shift-invariant or convolutional sparse coding problem. Assuming a sparse data matrix XεR^(c×t) as a realization of ξ 302, one can rewrite eq (21) into a convolutional sparse matrix factorization problem:

$\begin{matrix} {{\underset{{W \in R_{+}},{H \in R_{+}}}{\min\;}{L\left( {X,W,H} \right)}} =} & (22) \\ {{\frac{1}{2}{{X - {W*H}}}_{F}^{2}} + {\lambda{\sum\limits_{i,j}\;{f\left( H_{ij} \right)}}}} & (23) \end{matrix}$ where ∥•∥_(F) denotes the Frobenius norm, * denotes the 2D convolutional operator, and ƒ denotes a sparseness measure on the coefficient matrix H (e.g, maximum absolute column sum norm, spectral norm, or maximum absolute row sum norm). Instead of ∥•∥_(F), other loss functions may be defined, such as the alpha-divergence, beta-divergence, or gamma-divergence. The beta-divergence will be discussed herein, but this is intended for the purpose of illustration and is not meant to be limiting.

The beta-divergence for R_([0,1]) is defined as

$\begin{matrix} {{d_{\beta}\left( X \middle| \overset{\sim}{X} \right)} = {\frac{1}{\beta\left( {\beta - 1} \right)}\left( {X^{\beta} + {\left( {\beta - 1} \right){\overset{\sim}{X}}^{\beta}} - {\beta\; X{\overset{\sim}{X}}^{\beta - 1}}} \right)}} & (24) \end{matrix}$ where X≈W*H. Special cases of the beta-divergence are the generalized Kullback-Liebler divergence (KLD), the Itakura-Saito divergence (ISD), and the Euclidean distance (ED).

$\begin{matrix} {{d_{\beta = 0}^{ISD}\left( X \middle| \overset{\sim}{X} \right)} = {\frac{X}{\overset{\sim}{X}} - {\log\frac{X}{\overset{\sim}{X}}} - 1}} & (25) \\ {{d_{\beta = 1}^{KLD}\left( X \middle| \overset{\sim}{X} \right)} = {{X\;\log\frac{X}{\overset{\sim}{X}}} + \overset{\sim}{X} - X}} & (26) \\ {{d_{\beta = 2}^{ED}\left( X \middle| \overset{\sim}{X} \right)} = {\frac{1}{2}\left( {X - \overset{\sim}{X}} \right)^{2}}} & (27) \end{matrix}$

The scale invariant property d _(β=0)(γX,γ{tilde over (X)})=d _(β=0)(X,{tilde over (X)}),∀γ>0  (28) of ISD as the limiting case of the beta-divergence (β=0) allows one to find basis components of differing complexity, whereas the ED and KLD penalizes basis components of low energy. To account for double sparsity, (having sparsity in the data as well as in the latent factor model, one may regularize the divergence by inducing a double sparsity constraint on W and H. The double sparsity constraint further allows one to build an over-complete bases set, where the factorization rank k can be defined such that k is larger than the actual bases' elements in the data. The over-complete bases representation addresses the rank selection problem where irrelevant basis elements are squashed to be zero and only a few basis elements that are supported in the data are retained. The generalized form of eqs 22 and 23 for the beta-divergence is

$\begin{matrix} {{\underset{{W \in R_{+}},{H \in R_{+}}}{\min\;}{L\left( {X,W,H} \right)}} =} & (29) \\ {{{??}_{\beta}\left( X \middle| {W*H} \right)} + {\lambda_{1}{\varphi_{1}(W)}} + {\lambda_{2}{{\varphi_{2}(H)}.}}} & (30) \end{matrix}$

The joint objective of eqs 29 and 30 is non-convex overall, but convex with respect to W and H individually. For individual patterns, the objective function of equations 29 and 30 comprises a loss function that measures the approximation error of the factorization and a regularizer φ on the individual temporal patterns W and the individual activation codes H. λ₁ and λ₂ are weighting factors that influence the strength of the regularizer and trades-off the approximation error vs. the induced constraints. The problem uses an alternative optimization, such as block coordinate descent, where each factor is optimized in an alternate fashion. By setting φ_(i), to be ∥•∥₂ or ∥•∥₁, smoothness or sparsity can be enforced in trade-off with the approximation error of the factorization. Update rules for the doubly sparse convolutional decomposition model can be obtained by taking the gradient of L with respect to factors W and H diagonally resealing the gradient with an appropriate learning rate η: W=W−η _(W)∇_(W) L  (31) H=H−η _(H)∇_(H) L  (32) where η_(W) and η_(H) are learning rates that define the step size of the alternating gradient descent walk. For clarity, the non-convolutional forms of

$\frac{\partial L}{\partial W}\mspace{14mu}{and}\mspace{14mu}\frac{\partial L}{\partial H}$ are described first. The update rules for a static linear data model of eq (12) with the Frobenius loss can be derived, resulting in:

$\begin{matrix} {W:={{W \circ \left( {XH}^{T} \right)}/\left( {{WHH}^{T} + {\lambda_{1}\frac{\partial{\varphi_{1}(W)}}{\partial w}} + ɛ} \right)}} & (33) \\ {{H:={{H \circ \left( {W^{T}X} \right)}/\left( {{W^{T}{WH}} + {\lambda_{2}\frac{\partial{\varphi_{2}(H)}}{\partial h}} + ɛ} \right)}},} & (34) \end{matrix}$ where a ‘∘’ (the Hadamard or Shur product) and ‘/’ are element-wise operators and ε is a small constant that is added to the denominator to prevent division by zero. The additional regularizers φ₁ and φ₂, require a scaling constraint on the factors W and H to prevent trivial solutions in the factorization. Normalization constraints on both factors can be enforced to balance the terms of the objective function. W uses unit norm bases, while H uses unit norm coefficients. The update rules for equations 26 and 27 are

$\begin{matrix} {W^{KLD}:={W \circ \frac{\left( {X/{WH}} \right)H^{T}}{{1 \cdot H^{T}} + {\lambda_{1}\frac{\partial{\varphi_{1}(W)}}{\partial w}} + ɛ}}} & (35) \\ {H^{KLD}:={H \circ \frac{W^{T}\left( {X/{WH}} \right)}{{1 \cdot W^{T}} + {\lambda_{2}\frac{\partial{\varphi_{2}(H)}}{\partial h}} + ɛ}}} & (36) \\ {W^{ISD}:={W \circ \frac{\left( {X/({WH})^{2}} \right)H^{T}}{{\frac{1}{WH} \cdot H^{T}} + {\lambda_{1}\frac{\partial{\varphi_{1}(W)}}{\partial w}} + ɛ}}} & (37) \\ {H^{KLD}:={{H \circ \frac{W^{T}\left( {X/({WH})^{2}} \right)}{{W^{T}\frac{1}{WH}} + {\lambda_{2}\frac{\partial{\varphi_{2}(H)}}{\partial h}} + ɛ}}.}} & (38) \end{matrix}$

These equations are particular instances of the general beta-divergence, where the generalized update equations take the form

$\begin{matrix} {W^{BD}:={W \circ \frac{\left( {X \circ ({WH})^{\beta - 2}} \right)H^{T}}{{\left( {WH}^{\beta - 1} \right) \cdot H^{T}} + {\lambda_{1}\frac{\partial{\varphi_{1}(W)}}{\partial w}} + ɛ}}} & (39) \\ {H^{BD}:={{H \circ \frac{W^{T}\left( {X \circ ({WH})^{\beta - 2}} \right)}{{W^{T}({WH})}^{\beta - 1} + {\lambda_{2}\frac{\partial{\varphi_{2}(H)}}{\partial h}} + ɛ}}.}} & (40) \end{matrix}$

The convolutional form of eqs 39 and 40 can be interpreted as finding T different factorizations {W}_(t=1) ^(T) and {H}_(t=1) ^(T). Here T denotes the size of the time window that is used to capture the dynamic structure of the spatial-temporal process ξ. The convolutional form of eqs 39 and 40 may be written in the form of a zero-one shift matrix.

Shifting matrices are zero-one matrices that have useful properties for the analysis of time series models. A shifting matrix S is a n×n matrix of the form

$\begin{matrix} {{{S_{1}\begin{bmatrix} 0 & \; & \; & \; & 0 \\ 1 & \ddots & \; & \; & \; \\ \; & \ddots & \ddots & \; & \; \\ \; & 0 & \ddots & \ddots & \; \\ \; & \; & \; & 1 & 0 \end{bmatrix}} = \begin{bmatrix} 0 & 0 \\ I_{n - 1} & 0 \end{bmatrix}},} & (41) \end{matrix}$ where S₁ is the first associated shifting matrix out of n shifting matrices. S₁ has off-diagonal entries of value one and zero elsewhere. The pre- or post-multiplication of a matrix H with S₁ shifts the entries of H by one row or column respectively. The operator fills up the empty space that is created due to the shift with zero values. Shifting can be performed in a bi-directional manner. To right- and left-shift H by n shifts, one can use: H _(n→) =HS _(n) ^(T)  (42) H _(←n) =HS _(n).  (43) Thus, in convolutional form, equations 39 and 40 can be written as:

$\begin{matrix} {W:={W \circ \frac{\sum\limits_{t = 1}^{T}{\left( {B + {{WW}^{T}A}} \right)H^{T}S_{i}^{T}}}{\sum\limits_{t = 1}^{T}\left( {{\left( {A + {{WW}^{T}B}} \right)H^{T}S_{i}^{T}} + {\lambda_{1}\frac{\partial{\varphi_{1}(W)}}{\partial w}} + ɛ} \right)}}} & (44) \\ {H:={H \circ \frac{\sum\limits_{t = 1}^{T}{W^{T}\left( {X \circ \left( {WHS}_{i} \right)^{\beta - 2}} \right)}}{\sum\limits_{t = 1}^{T}\left( {{W^{T}\left( {WHS}_{i} \right)}^{\beta - 1} + {\lambda_{2}\frac{\partial{\varphi_{2}(H)}}{\partial h}} + ɛ} \right)}}} & (45) \\ {A = \left( {WHS}_{i}^{T} \right)^{\beta - 1}} & (46) \\ {B = {X \circ \left( {WHS}_{i}^{T} \right)^{\beta - 2}}} & (47) \end{matrix}$ where WW^(T) results from the normalization constraint on W_(normalized)=∥W∥_(F). The complete tensor W may be normalized by its l₂-norm, the Frobenius norm. The additional regularizers φ₁ and φ₂ require a scaling constraint on the factors W and H to prevent trivial solutions in the factorization. In general, normalization constraints on both factors can be enforced to balance the terms of the objective function. W needs to have unit norm bases. This normalization constraint is sufficient for the standard sparse coding framework, but insufficient for coping with the double sparsity problem. This factorization allows the learning of an efficient minimalistic representation of ξ 302.

Whereas one could now use the latent factor model to perform group based analysis using a clustering scheme, the non-convex and non-unique objective of equations (29) and (30) impose problems regarding the reproducibility of the learned representation. In this regard, our goal is to learn the hidden group structure jointly given

_(ξ), or

_(ξ).

Multiple spatial-temporal point processes form a 3-way tensor where individual realizations of ξ_(i) are stacked up on top of each other. To learn a group of multiple spatial point processes

_(ξ)={ξ}_(i=1) ^(n)εR^(c×t×n), several different strategies may be employed. Referring now to FIG. 4, an illustration of

_(ξ) 402 is shown, collecting a plurality of samples numbered from 1 to n. In this way, multiple temporal event matrices can be represented as a single tensor.

A learning process for a group of STPPs may be of the form:

$\begin{matrix} {{\min\limits_{{W \geq 0},{H^{(n)} \geq 0}}\;{L\left( {X^{(n)},W,H^{(n)}} \right)}} =} & (48) \\ {{\sum\limits_{i = 1}^{n}\;{{??}_{\beta}\left( \left. X^{(i)} \middle| {W*H^{(l)}} \right.\; \right)}} + {\lambda_{1}{\varphi_{1}(W)}} + {\lambda_{2}{{\varphi_{2}\left( H^{(i)} \right)}.}}} & (49) \end{matrix}$ where X^((n))εR^(c×t×n), WεR₊ ^(u×v×k), and H^((n))ε₊ ^(k×t×n). In this setting, an efficient minimalistic group representation of

_(ξ) 402 arises that is able to account for variable length STPPs ξ_(i). Using the multiple TEMRs 302 in

_(ξ) 402, the objective function of equations (48) and (49) use a W that includes population temporal patterns and an H^((i)) that includes population temporal codes. The update equations for learning W and H^((i)) are A ^((i))=(WH ^((i)) S _(t) ^(T))^(β-1)  (50) B ^((i)) =X ^((i))∘(WH ^((i)) S _(t) ^(T))^(β-2),  (51) with the partial derivative being

$\begin{matrix} {{\nabla_{W}J^{-}} = {\sum\limits_{t = 1}^{T}\;{\left( {B^{(i)} + {{WW}^{T}A^{(i)}}} \right)H^{T{(i)}}S_{i}^{T}}}} & (52) \\ {{\nabla_{W}J^{-}} = {{\sum\limits_{t = 1}^{T}\;{\left( {A^{(i)} + {{WW}^{T}B^{(i)}}} \right)H^{T{(n)}}S_{i}^{T}}} + {\lambda_{1}\frac{\partial{\varphi_{1}(W)}}{\partial w}}}} & (53) \\ {W = {{W \circ \frac{\nabla_{W}J^{-}}{\nabla_{W}J^{+}}}.}} & (54) \end{matrix}$ For H^((i)):

$\begin{matrix} {{\nabla_{H^{(i)}}J^{-}} = {\sum\limits_{t = 1}^{T}{W^{T}\left( {X^{(i)} \circ \left( {{WH}^{(i)}S_{i}} \right)^{({\beta - 2})}} \right)}}} & (55) \\ {{\nabla_{H^{(i)}}J^{+}} = {{\sum\limits_{t = 1}^{T}{W^{T}\left( {{WH}^{(i)}S_{i}} \right)}^{({\beta - 1})}} + {\lambda_{2}\frac{\partial{\varphi_{2}\left( H^{(i)} \right)}}{\partial h}}}} & (56) \\ {H^{(i)} = {{H^{(i)} \circ \frac{\nabla_{H^{(i)}}J^{-}}{\nabla_{H^{(i)}}J^{+}}}.}} & (57) \end{matrix}$

A stochastic gradient descent scheme is used to learn the group structure of

_(ξ) 402 in an incremental fashion. Exemplary methods are shown herein, though it is contemplated that other learning schemes might be used. Referring now to FIG. 5, a first method for stochastic optimization of a group structure is shown. A loop starts at block 502, initializing the index t to one. Block 504 then draws a set of inputs X^((t)) from

_(ξ) 402. In this context, to “draw” a matrix can be understood as randomly selecting a single matrix 302 from the TEMR tensor representation, as

_(ξ) 402 is composed of multiple matrices. Block 505 then draws H^((i)) from H^((n)), as each X^((i)) has an associated H^((i)). The W matrix is normalized at each of its k elements by block 506. Block 508 begins a new loop across the H matrices, initializing an index i_(H) to 1. Block 510 updates H^((t) ^(n)) using equation (57). Block 512 then computes L(X^((n)), W, H^((n))) according to equation 49. Block 514 then determines whether there is convergence. If there is convergence, the loop breaks and processing moves on to block 520. If not, the loop tests to see if t_(H) has reached T_(H). If so, the loop ends and processing moves on to block 520. If not, t_(H) is incremented and processing returns to the block 510, where a new H^((t) ^(n)) is selected.

Block 520 begins a new loop for the W matrices, initializing an index t_(W)=1. Block 522 updates W according to equation (54). Block 524 normalizes W again for all k elements. Block 526 again computes L(X_((n)), W, H^((n))). Block 528 checks for convergence. If convergence is found, the loop breaks and processing moves on to block 534. If not, the loop checks whether t_(W) has reached T_(W). If so, the loop ends and processing moves to block 534. If not, block 532 increments t_(W) and returns processing to block 522. Block 534 determines whether the overall index t has reached T. If not, block 536 increments t and processing returns to block 504. If so, block 538 returns the group structure Θ is returned.

Referring now to FIG. 6, a method used by temporal event mining component 110 is shown. The temporal event mining component 110 takes as input in block 602 a set of population temporal patterns W and a set of population temporal codes H^((t)). A user may customize how population temporal patterns are handled via user-dependent selection and refinement criteria at block 604. Block 605 uses user-refined population temporal patterns to estimate updated population temporal codes. Block 606 performs clustering and block 610 performs retrieval using a learning algorithm such as that shown in FIG. 5 above. Block 606 produces an output 612 of a partition of multiple TEMR groups, where each group includes similar TEMR instances governed by pre-defined or learned distance metrics. Retrieval block 610 outputs 614 a ranked list of similar TEMRs based on a given query TEMR. Clustering and ranking are shown for the sake of illustration. Other learning paradigms may be used instead or in addition.

Referring now to FIG. 7, an open-ended temporal event mining system 700 is shown. The temporal event mining system 700 comprises a memory system 701 and a processor 713 in communication. A data model 702 stores unstructured, heterogeneous event data of any generic population entity, such as people, patients, locations, etc. The data model may be stored in any sort of physical storage device and may receive its event data from any input, including automated sensors and manual entry. An event matrix generator 704 converts a population entity within the data model to multiple TEMRs 706. A constraint sparse coding component 708 learns a sparse representation 710 of TEMRs 706 according to the principles described above. A temporal event data mining component 712 performs analytics on the sparse representation 710 for knowledge discovery and is connected to a visualization display 714. Temporal event data mining component 712 uses processor 713 to perform data mining. The display 714 allows a user 716 to perform interactive refinement on the learned sparse TEMR model 710. In this manner, the user can guide the event mining system and rapidly acquire relevant information.

Having described preferred embodiments of a system and method for mining temporal patterns in longitudinal event data using discrete event matrices and sparse coding (which are intended to be illustrative and not limiting), it is noted that modifications and variations can be made by persons skilled in the art in light of the above teachings. It is therefore to be understood that changes may be made in the particular embodiments disclosed which are within the scope of the invention as outlined by the appended claims. Having thus described aspects of the invention, with the details and particularity required by the patent laws, what is claimed and desired protected by Letters Patent is set forth in the appended claims. 

What is claimed is:
 1. A method for event pattern mining comprising: representing longitudinal event data in a measurable geometric space as a temporal event matrix representation (TEMR) using spatial temporal shapes, wherein event data is organized into hierarchical categories of event type; and performing temporal event pattern mining with a processor by locating visual event patterns among the spatial temporal shapes of said TEMR using a constraint sparse coding framework.
 2. The method of claim 1, wherein said representing further comprises mapping event information from a probabilistic event space to said measurable geometric space.
 3. The method of claim 1 wherein said performing temporal event pattern mining further comprises online non-negative matrix factorization.
 4. The method of claim 1, further comprising refining event patterns using user feedback.
 5. The method of claim 1, wherein performing temporal event pattern mining further comprises extracting individual latent temporal patterns in the form of feature images and activation codes from data for an entity.
 6. The method of claim 1, wherein sparsity is enforced in the geometric representation using one or more regularizers.
 7. The method of claim 1, wherein the TEMR is constrained to prevent trivial solutions.
 8. The method of claim 1, wherein performing temporal event pattern mining further comprises clustering multiple entities into pattern groups using exploratory analytic learning.
 9. The method of claim 1, wherein performing temporal event pattern mining further comprises ranking entities by similarity to a test pattern.
 10. The method of claim 1, wherein event information is mapped to a spatial-temporal shape process in the form of a discrete event matrix.
 11. The method of claim 1, wherein the spatial temporal shapes include at least one of single events, event intervals, and high-order event structures.
 12. A non-transitory computer readable storage medium comprising a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform the method of claim
 1. 13. A method for event pattern mining comprising: mapping longitudinal event data from a probabilistic event space to a temporal event matrix representation (TEMR) in a measurable geometric space, wherein event data is organized into hierarchical categories of event type; performing temporal event pattern mining with a processor by locating visual event patterns among spatial temporal shapes of said TEMR using a processor to perform online non-negative matrix factorization by clustering and ranking multiple entities into pattern groups; and refining the learned patterns using user feedback.
 14. A system for event pattern mining comprising: an event matrix generator configured to represent longitudinal event data in a measurable geometric space as a temporal event matrix representation (TEMR) using spatial temporal shapes, wherein event data is organized into hierarchical categories of event type; and a temporal event data mining component configured to perform temporal event pattern mining with a processor by locating visual event patterns among the spatial temporal shapes of said TEMR using a constraint sparse coding framework.
 15. The system of claim 14, wherein the event matrix generator is configured to map event information from a probabilistic event space to said measurable geometric space.
 16. The system of claim 14, wherein the temporal event data mining component is further configured to perform online non-negative matrix factorization.
 17. The system of claim 14, further comprising a constraint sparse coding component configured to enforce sparsity in the representation using a regularizer.
 18. The system of claim 17, wherein the constraint sparse coding component uses user feedback to refine the sparse representation.
 19. The system of claim 17, wherein the TEMR is constrained to prevent trivial solutions.
 20. The system of claim 14, wherein the temporal event data mining component is further configured to extract individual latent temporal patterns in the form of feature images and activation codes from data for an entity.
 21. The system of claim 14, wherein the temporal event data mining component is further configured to cluster multiple entities into pattern groups using exploratory analytic learning.
 22. The system of claim 14, wherein the temporal event data mining component is further configured to rank entities by similarity to a test pattern.
 23. The system of claim 14, wherein event information is mapped to a spatial-temporal shape process in the form of a discrete event matrix.
 24. The system of claim 14, wherein the spatial temporal shapes include at least one of single events, event intervals, and high-order event structures. 